Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
نویسندگان
چکیده
In this paper, we present improved strategies in DLM-99-SAT to escape from traps and to select proper parameter sets to use when applied to solve some dif-cult but satissable SAT problems. One of the main issues in DLM-99-SAT is that it has a large number of tune-able parameters, making it diicult to determine the best parameters to use when given a new instance. To this end, we propose a set of performance metrics and a set of rules using these metrics that determine at run time the best parameters to use for a speciic instance. Our experimental results show that these rules are able to select the most suitable parameter set for each instance with very little overhead. Finally , we verify the performance of DLM-99-SAT by solving some benchmarks in SATLIB and some of the most diicult but satissable DIMACS SAT problems, including par32-1-c to par32-4-c and hanoi4-simple.
منابع مشابه
Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems
In this paper, we present efficient trap-escaping strategies in a search based on discrete Lagrange multipliers to solve difficult SAT problems. Although a basic discrete Lagrangian method (DLM) can solve most the satisfiable DIMACS SAT benchmarks efficiently, a few of the large benchmarks have eluded solutions by any local-search methods today. These difficult benchmarks generally have many tr...
متن کاملA discrete Lagrangian-based global-search method for solving satisfiability problems
Satisfiability is a class of NP-complete problems that model a wide range of real-world applications. These problems are difficult to solve because they have many local minima in their search space, often trapping greedy search methods that utilize some form of descent. In this paper, we propose a new discrete Lagrange-multiplier-based global-search method (DLM) for solving satisfiability probl...
متن کاملAn Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems
In this paper, we present an efficient global-search strategy in an algorithm based on the theory of discrete Lagrange multipliers for solving difficult SAT instances. These difficult benchmarks generally have many traps and basins that attract local-search trajectories. In contrast to trapescaping strategies proposed earlier (Wu & Wah 1999a; 1999b) that only focus on traps, we propose a global...
متن کاملDiscrete Lagrangian-Based Search for Solving MAX-SAT Problems
Weighted maximum satissability problems (MAX-SAT) are diicult to solve due to the large number of local minima in their search space. In this paper we propose a new discrete Lagrangian based search method (DLM) for solving these problems. Instead of restarting from a new point when the search reaches a local minimum, the Lagrange multipliers in DLM provide a force to lead the search out of the ...
متن کاملA Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems
In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...
متن کامل